Local Search For Satisfiability Modulo Integer Arithmetic Theories

Satisfiability Modulo Theories (SMT) refers to the problem of deciding satisfiability a formula with respect certain background first-order theories. In this paper, we focus on Satisfiablity Integer Arithmetic, which is referred as SMT(IA), including both linear and non-linear integer arithmetic Dominant approaches SMT rely calling CDCL-based SAT solver, either in lazy or eager flavour. Local search, competitive approach solving combinatorial problems SAT, however, has not been well studied for SMT. We develop first local-search algorithm SMT(IA) by directly operating variables, breaking through traditional framework. propose framework considering distinctions between Boolean variables. Moreover, design novel operator scoring functions tailored arithmetic, two-level operation selection heuristic. Putting these together, local search solver called LocalSMT. Experiments are carried out evaluate LocalSMT benchmark sets from SMT-LIB. The results show that complementary state-of-the-art solvers, performs particularly those formulae only A simple sequential portfolio Z3 improves satisfiable